Extending linear relaxation for non-square matrices and soft constraints

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Using an Efficient Penalty Method for Solving Linear Least Square Problem with Nonlinear Constraints

In this paper, we use a penalty method for solving the linear least squares problem with nonlinear constraints. In each iteration of penalty methods for solving the problem, the calculation of projected Hessian matrix is required. Given that the objective function is linear least squares, projected Hessian matrix of the penalty function consists of two parts that the exact amount of a part of i...

متن کامل

Square regularization matrices for large linear discrete ill-posed problems

Large linear discrete ill-posed problems with contaminated data are often solved with the aid of Tikhonov regularization. Commonly used regularization matrices are finite difference approximations of a suitable derivative and are rectangular. This paper discusses the design of square regularization matrices that can be used in iterative methods based on the Arnoldi process for large-scale Tikho...

متن کامل

An Abstract Domain Extending Difference-Bound Matrices with Disequality Constraints

Knowing that two numerical variables always hold different values, at some point of a program, can be very useful, especially for analyzing aliases: if i 6= j, then A[i] and A[j] are not aliased, and this knowledge is of great help for many other program analyses. Surprisingly, disequalities are seldom considered in abstract interpretation, most of the proposed numerical domains being restricte...

متن کامل

Soft Constraints in Integer Linear Programs

Here Y is the feasible region for the structures. We use the standard approach to break the structure into a collection of parts and extract features from them. Let each yi ∈ y correspond to a part in the structure. That is the inference variable yi is an indicator for the existence of the i th part in the structure. Let the feature function Φ decompose into a sum of features for each part. Tha...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computational and Applied Mathematics

سال: 2016

ISSN: 0377-0427

DOI: 10.1016/j.cam.2016.05.006